An improved guided random walk algorithm for quantum field theory computations
نویسندگان
چکیده
منابع مشابه
An Improved Random Walk Based Community Detection Algorithm
Community detection is an important issue in social network analysis, which aims at finding potential community structures such that the internal nodes of a community have higher closeness than external nodes. Taking into account node attribute information, this paper presents an improved community detection algorithm based on random walk. Based on the basic understanding that people getting to...
متن کاملA Quantum Random Walk Search Algorithm
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speed-up over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random walk architectu...
متن کاملAn Improved Claw Finding Algorithm Using Quantum Walk
The claw finding problem has been studied in terms of query complexity as one of the problems closely connected to cryptography. For given two functions, f and g, as an oracle which have domains of size N and M (N ≤ M), respectively, and the same range, the goal of the problem is to find x and y such that f (x) = g(y). This problem has been considered in both quantum and classical settings in t...
متن کاملThe Random Walk in Generalized Quantum Theory
One can view quantum mechanics as a generalization of classical probability theory that provides for pairwise interference among alternatives. Adopting this perspective, we “quantize” the classical random walk by finding, subject to a certain condition of “strong positivity”, the most general Markovian, translationally invariant “decoherence functional” with nearest neighbor transitions.
متن کاملAn Improved Gaussian Approximation for Quantum Field Theory
We present a new approximation technique for quantum field theory. The standard one-loop result is used as a seed for a recursive formula that gives a sequence of improved Gaussian approximations for the generating functional. In a different setting, the basic idea of this recursive scheme is used in the second part of the paper to substantialy speed up the standard Monte Carlo algorithm. http:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B
سال: 1986
ISSN: 0550-3213
DOI: 10.1016/0550-3213(86)90416-5